翻訳と辞書 Words near each other ・ Enumclaw and Kapoonis ・ Enumclaw Courier-Herald ・ Enumclaw High School ・ Enumclaw horse sex case ・ Enumclaw Regional Hospital ・ Enumclaw School District ・ Enumclaw, Washington ・ Enumerate ・ Enumerate (project) ・ Enumerated powers ・ Enumerated Powers Act ・ Enumerated type ・ Enumeratio plantarum quas in Novae Hollandiae ora austro-occidentali ad fluvium Cygnorum et in sinu Regis Georgii collegit Carolus Liber Baro de Hügel ・ Enumeration ・ Enumerations of specific permutation classes ・ Enumerative combinatorics ・ Enumerative definition ・ Enumerative geometry ・ Enumerative induction ・ Enumerator ・ Enumerator (computer science) ・ Enumerator polynomial ・ Enur (group) ・ Enuresis ・ Enurmino ・ Enusonai ・ ENV ・ Env ・ Env (disambiguation) ・ Env (gene) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Enumerative combinatorics ： ウィキペディア英語版 Enumerative combinatorics Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets ''S''''i'' indexed by the natural numbers, enumerative combinatorics seeks to describe a ''counting function'' which counts the number of objects in ''S''''n'' for each ''n''. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description. The twelvefold way provides a unified framework for counting permutations, combinations and partitions. The simplest such functions are ''closed formulas'', which can be expressed as a composition of elementary functions such as factorials, powers, and so on. For instance, as shown below, the number of different possible orderings of a deck of ''n'' cards is ''f''(''n'') = ''n''!. The problem of finding a closed formula is known as algebraic enumeration, and frequently involves deriving a recurrence relation or generating function and using this to arrive at the desired closed form. Often, a complicated closed formula yields little insight into the behavior of the counting function as the number of counted objects grows. In these cases, a simple asymptotic approximation may be preferable. A function $g(n)$ is an asymptotic approximation to $f(n)$ if $f(n)/g(n)\backslash rightarrow\; 1$ as $n\backslash rightarrow\; \backslash infty$. In this case, we write $f(n)\; \backslash sim\; g(n).\backslash ,$ ==Generating functions== Generating functions are used to describe families of combinatorial objects. Let $\backslash mathcal$ denote the family of objects and let ''F''(''x'') be its generating function. Then: :$F(x)\; =\; \backslash sum^\_f\_nx^n$ Where $f\_n$ denotes the number of combinatorial objects of size ''n''. The number of combinatorial objects of size ''n'' is therefore given by the coefficient of $x^n$. Some common operation on families of combinatorial objects and its effect on the generating function will now be developed. The exponential generating function is also sometimes used. In this case it would have the form: :$F(x)\; =\; \backslash sum^\_\backslash fracx^n$ Once determined, the generating function yields the information given by the previous approaches. In addition, the various natural operations on generating functions such as addition, multiplication, differentiation, etc., have a combinatorial significance; this allows one to extend results from one combinatorial problem in order to solve others. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Enumerative combinatorics」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.